Algorithm forRegular Grammar Inference ?
نویسنده
چکیده
We present provably correct interactive algorithms for learning regular grammars from positive examples and membership queries. A structurally complete set of strings from a language L(G) corresponding to a target regular grammar G implicitly speciies a lattice of nite state automata (FSA) which contains a FSA MG corresponding to G. The lattice is compactly represented as a version-space and MG is identiied by searching the version-space using membership queries. We explore the problem of regular grammar inference in a setting where positive examples are provided intermittently. We provide an incremental version of the algorithm along with a set of suucient conditions for its convergence.
منابع مشابه
Mildly context sensitive grammar induction and variational bayesian inference
We define a generative model for a minimalist grammar formalism. We present a generalized algorithm for the application of variational bayesian inference to lexicalized mildly context sensitive grammars. We apply this algorithm to the minimalist grammar model.
متن کاملLearning Stochastic Context-Free Grammars from Corpora Using a Genetic Algorithm
A genetic algorithm for inferring stochastic context-free grammars from nite language samples is described. Solutions to the inference problem are evolved by optimizing the parameters of a covering grammar for a given language sample. We describe a number of experiments in learning grammars for a range of formal languages. The results of these experiments are encouraging and compare very favour...
متن کاملA Grammar Inference Algorithm for Event Recognition in Sensor Networks
In this paper, we demonstrate that probabilistic context free grammars (PCFGs) can be used to recognize events from a sensor data stream. A fast PCFG inference algorithm based on Stolcke(1994) and Chen(1996) is presented which utilizes the set of observation strings as training data. A realworld scenario is presented and we also show that multi-modal sensor information can be utilized using Dem...
متن کاملContext–free grammar induction using evolutionary methods
The research into the ability of building self-learning natural language parser based on context–free grammar (CFG ) was presented. The paper investigates the use of evolutionary methods: a genetic algorithm, a genetic programming and learning classifier systems for inferring CFG based parser. The experiments were conducted on the real set of natural language sentences. The gained results confi...
متن کاملGrammar Induction and Genetic Algorithms: An Overview
Grammar Induction (also know as Grammar Inference or Language Learning) is the process of learning of a grammar from training data. This paper discusses the various approaches for learning context-free grammar (CFG) from the corpus of string and presents the approach of informant learning in the form of result for two standard grammar problems namely Balanced Parenthesis Grammar and Palindrome ...
متن کامل